An asymmetric generalisation of Artin monoids
نویسنده
چکیده
We propose a slight weakening of the definitions of Artin monoids and Coxeter monoids. We study one ‘infinite series’ in detail.
منابع مشابه
Monoids in the fundamental group . . .
We study monoids generated by Zariski-van Kampen generators in the 17 fundamental groups of the complement of logarithmic free divisors in C listed by Sekiguchi (Theorem 1). Five of them are Artin monoids and eight of them are free abelian monoids. The remaining four monoids are not Gaußian and, hence, are neither Garside nor Artin (Theorem 2). However, we introduce, similarly to Artin monoids,...
متن کاملUniversal Upper Bound for the Growth of Artin Monoids
In this paper we study the growth rates of Artin monoids and we show that 4 is a universal upper bound. We also show that the generating functions of the associated right-angled Artin monoids are given by families of Chebyshev polynomials. Applications to Artin groups and positive braids are given.
متن کاملOn Singular Artin Monoids
In this paper we study some combinatorial aspects of the singular Artin monoids. Firstly, we show that a singular Artin monoid SA can be presented as a semidirect product of a graph monoid with its associated Artin group A. Such a decomposition implies that a singular Artin monoid embeds in a group. Secondly, we give a solution to the word problem for the FC type singular Artin monoids. Afterwa...
متن کاملSingular Artin Monoids of Finite Coxeter Type Are Automatic
We consider the positive singular and the singular Artin monoids of finite type. These have been the subject of a great deal of recent research and the main purpose of this paper is to prove that these monoids are automatic. In order to do this we establish a new criterion for proving monoids automatic that may be of independent interest.
متن کاملRewriting Systems and Embedding of Monoids in Groups
In this paper, a connection between rewriting systems and embedding of monoids in groups is found. We show that if a group with a positive presentation has a complete rewriting system R that satisfies the condition that each rule in R with positive left-hand side has a positive right-hand side, then the monoid presented by the subset of positive rules from R embeds in the group. As an example, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Groups Complexity Cryptology
دوره 5 شماره
صفحات -
تاریخ انتشار 2013